A multi-operator genetic algorithm for the diversified replenishment problem

نویسندگان

  • Islem Kaabachi
  • Hiba Yahyaoui
  • Abdelkader Dekdouk
  • Saoussen Krichen
چکیده

In this paper, we propose a Multi-operator Genetic Algorithm (MGA) for solving the diversified fuel replenishment problem (DFRP). We particularly consider the delivery problem of multiple types of fuels to n stations geographically dispersed in an addressed area. The main objective of the delivery process is to minimize the total travel distance of a fleet of trucks equipped by multi-compartment tanks. Numerous structural constraints are to be respected, namely assignment constraints that express the capacity limitations of each truck’s compartment and routing constraints that state pathways’ restrictions. The performance of the proposed algorithm is evaluated using a set of benchmark instances and compared to exact solutions generated by Cplex. Fuel station replenishment, Vehicle routing problem, Multi-operator genetic algorithm.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Node-based Mathematical Model towards the Location Routing Problem with Intermediate Replenishment Facilities under Capacity Constraint

In this paper, we study the location routing problem with replenishment facilities (LRPRF), an extension of the location routing problem (LRP) where the vehicles can replenish at some replenishment facilities. Vehicles leave the depot with load on-board, serve customers until out of load, and then either return to a replenishment facility to reload or return to the depot, completing their route...

متن کامل

Modelling Integrated Multi-item Supplier Selection with Shipping Frequencies

There are many benefits for coordination of multiple suppliers when single supplier cannot satisfy buyer demands.  In addition, buyer needs to purchase multiple items in a real supply chain. So, a model that satisfies these requests has many advantages. We extend the existing approaches in the literature that assume all suppliers need to be put on a common replenishment cycle and each supplier ...

متن کامل

Presenting a Joint Replenishment-location Model Under all-units Quantity Discount and Solving by Genetic Algorithm and Harmony Search Algorithm

In this paper a model is proposed for distribution centers location and joint replenishment of a distribution system that is responsible for orders and product delivery to distribution centers. This distribution centers are under limitedwarehouse space and this can determine amount of requirement product by considering proposed discount.The proposed model is develop to minimize total costs cons...

متن کامل

An Efficient Genetic Agorithm for Solving the Multi-Mode Resource-Constrained Project Scheduling Problem Based on Random Key Representation

In this paper, a new genetic algorithm (GA) is presented for solving the multi-mode resource-constrained project scheduling problem (MRCPSP) with minimization of project makespan as the objective subject to resource and precedence constraints. A random key and the related mode list (ML) representation scheme are used as encoding schemes and the multi-mode serial schedule generation scheme (MSSG...

متن کامل

A Multi-Mode Resource-Constrained Optimization of Time-Cost Trade-off Problems in Project Scheduling Using a Genetic Algorithm

In this paper, we present a genetic algorithm (GA) for optimization of a multi-mode resource constrained time cost trade off (MRCTCT) problem. The proposed GA, each activity has several operational modes and each mode identifies a possible executive time and cost of the activity. Beyond earlier studies on time-cost trade-off problem, in MRCTCT problem, resource requirements of each execution mo...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2016